Formalization of the Tietze extension theorem in MIZAR?

نویسندگان

  • Adam Naumowicz
  • ADAM NAUMOWICZ
چکیده

In this paper we report on the formalization of the Tietze extension theorem using the MIZAR system. This theorem has been formalized as a part of the project aimed at formalizing the Jordan curve theorem. However, this development has turned out to be also useful for other formalizations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formalization and Verification of Number Theoretic Algorithms Using the Mizar Proof Checker

In this paper, we introduce formalization of well-known number theoretic algorithms on the Mizar proof checking system. We formalized the Euclidean algorithm, the extended Euclidean algorithm and the algorithm computing the solution of the Chinese reminder theorem based on the source code of NZMATH which is a Python based number theory oriented calculation system. We prove the accuracy of our f...

متن کامل

Automated Reasoning for Mizar: Artificial Intelligence through Knowledge Exchange

This paper gives an overview of the existing link between the Mizar project for formalization of mathematics and Automated Reasoning tools (mainly the Automated Theorem Provers (ATPs)). It explains the motivation for this work, gives an overview of the translation method, discusses the projects and works that are based on it, and possible future projects and directions.

متن کامل

Formalizing Arrow’s theorem

We present a small project in which we encoded a proof of Arrow’s theorem – probably the most famous results in the economics field of social choice theory – in the computer using the Mizar system. We both discuss the details of this specific project, as well as describe the process of formalization (encoding proofs in the computer) in general.

متن کامل

DeepMath - Deep Sequence Models for Premise Selection

We study the effectiveness of neural sequence models for premise selection in automated theorem proving, one of the main bottlenecks in the formalization of mathematics. We propose a two stage approach for this task that yields good results for the premise selection task on the Mizar corpus while avoiding the handengineered features of existing state-of-the-art models. To our knowledge, this is...

متن کامل

Formalization of Ortholattices via Orthoposets

There are two approaches to lattices used in the Mizar Mathematical Library: on the one hand, these structures are based on the set with two binary operations (with an equational characterization as in [17]). On the other hand, we may look at them as at relational structures (posets – see [12]). As the main result of this article we can state that the Mizar formalization enables us to use both ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008